Table fetch processor instruction using table number to base address translation

ABSTRACT

A pipelined run-to-completion processor includes no instruction counter and only fetches instructions either: as a result of being prompted from the outside by an input data value and/or an initial fetch information value, or as a result of execution of a fetch instruction. Initially the processor is not clocking. An incoming value kick-starts the processor to start clocking and to fetch a block of instructions from a section of code in a table. The input data value and/or the initial fetch information value determines the section and table from which the block is fetched. A LUT converts a table number in the initial fetch information value into a base address where the table is found. Fetch instructions at the ends of sections of code cause program execution to jump from section to section. A finished instruction causes an output data value to be output and stops clocking of the processor.

TECHNICAL FIELD

The described embodiments relate generally to pipelinedrun-to-completion processors.

SUMMARY

In a first novel aspect, a pipelined run-to-completion processorincludes no instruction counter and only fetches instructions either: asa result of being prompted from the outside by an incoming input datavalue and/or an incoming initial fetch information value, or as a resultof execution of a fetch instruction. Due to the lack of an instructioncounter and the associated control circuitry which can be substantial,the pipelined run-to-completion processor can be realized in a smallamount of integrated circuit area. In one example, the pipelinedrun-to-completion processor is implemented in about ten thousandequivalent gates.

Initially the pipelined run-to-completion processor is stopped and isnot clocking. An initial fetch information value and/or input data valueis supplied to the processor. The initial fetch information value and/orinput data value kick-starts the processor into clocking and causes theprocessor to do an initial fetch of a block of instructions, where theblock of instructions is one block of many in a section of code. Thereare typically many sections of code in a table of code. There are manysuch tables of code stored in an external memory.

In a second novel aspect, which particular block of instructions it is(of which particular section, or which particular table) that is fetchedis determined by the input data value and/or the initial fetchinformation value. In one specific embodiment, a lookup table circuit inthe processor converts a table number value in the initial fetchinformation value into a base address value, where the base addressvalue is the address in the memory where the table starts. The offsetfrom the base address of the table to the beginning of the section ofcode may be specified by a part of the initial fetch information valueand/or by a part of the input data value, or the offset can be derivedfrom such parts of the initial fetch information value and/or input datavalue. Fetch instructions at the ends of sections of code cause programexecution to jump from section to section and/or from table to table. Atthe end of a program is a special “finished” instruction. Execution ofthis finished instruction causes an output data value to be output fromthe processor and causes clocking of the processor to stop.

In a third novel aspect, the incoming input data value and/or initialfetch information value causes the run-to-completion processor to startclocking, and execution of a finished instruction causes therun-to-completion processor to stop clocking.

In a fourth novel aspect, the pipelined run-to-completion processorexecutes a novel pop stack absolute instruction. The pop stack absoluteinstruction includes an opcode, an absolute pointer value, a “flag don'ttouch” bit, and predicate bits. A register file of the processor is usedas a stack. A data value is stored in the register file, with a datavalue portion (a portion of the larger data value) being stored in aparticular register of the register file. If a condition indicated bythe predicate bits is not true, then an operation of the instruction isnot performed. If the condition is true, then the stack of the processoris popped thereby generating an operand A. The absolute pointer valueidentifies the particular register of the stack. The identification ofthe register is not relative to a stack pointer or to the top of thestack, but rather the identification is “absolute” in that the absolutepointer value points to a specific register independent of the value ofa stack pointer or which register is the top of the stack. The datavalue portion stored in this identified particular register is then usedas an operand B. The arithmetic logic operation specified by the opcodeof the instruction is performed using operand A and operand B therebygenerating a result, and the data value portion in the particularregister of the stack is replaced with the result. If the “flag don'ttouch bit” is set to a particular value, then the flag bits (carry flagand zero flag) are not affected by execution of the instruction.

Further details and embodiments and techniques are described in thedetailed description below. This summary does not purport to define theinvention. The invention is defined by the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, where like numerals indicate like components,illustrate embodiments of the invention.

FIG. 1 is a diagram of system 1 involving a pipelined run-to-completionprocessor 4 in accordance with one novel aspect.

FIG. 2 is a diagram of the tables of code stored in the external memorysystem 3 of FIG. 1.

FIG. 3 is a diagram of one section of code in the external memory systemof FIG. 1.

FIG. 4 is a diagram of one 128-bit block of information within thesection of code of FIG. 3.

FIG. 5 is a diagram of a fetch instruction in which the offset value isa value in the initial fetch information value.

FIG. 6 is diagram of a fetch instruction in which the offset value is avalue in the input data value.

FIG. 7 is diagram of a fetch instruction in which the offset value is ina specified register of the register file of the processor.

FIG. 8 is a diagram of a fetch more instruction.

FIG. 9 is a diagram of a pop stack absolute instruction.

FIG. 10 is a table illustrating the meaning of predicate bits in theinstruction of FIG. 9.

FIG. 11 is a diagram of a finished instruction.

FIG. 12 is a state diagram for the clock control state machine 6 of theprocessor 4 of FIG. 1.

FIG. 13 is a simplified diagram of one possible implementation of thelookup table circuit 30 within the fetch request stage 8 of FIG. 1.

FIG. 14 is a flowchart of a method 100 in accordance with one novelaspect.

DETAILED DESCRIPTION

Reference will now be made in detail to background examples and someembodiments of the invention, examples of which are illustrated in theaccompanying drawings.

FIG. 1 is a high-level block diagram of a system 1 including a processorcircuit 2 and a memory system 3 in accordance with one novel aspect. Theprocessor circuit 2 includes a pipelined run-to-completion processor 4and an initial fetch information determination circuit 5. The pipelinedrun-to-completion processor 4 includes a clock control state machine 6and a pipeline 7. The pipeline 7 includes a fetch request stage 8, afetch shift selector stage 9, a decode stage 10, a register file readstage 11, and an execute stage 12. The pipelined run-to-completionprocessor 4 receives input data values from an external circuit viainput data port 13, and receives initial fetch information values viainitial fetch information port 14, and outputs output data values to anexternal circuit via output data port 15.

Initially, the state machine 6 is in the idle state 16. The pipeline isclocked by the clock signal CLK 17. In the idle state, the state machinedisables the clock signal CLK. The pipeline 7 is therefore not beingclocked, and power consumption of the processor 4 is reduced. In theidle state, the state machine 6 also outputs the idle signal 18 viaconductor 19. An external circuit external to the processor thensupplies an input data value 20 onto the input data port 13 of theprocessor and asserts the start signal 21 (also referred to as the “PEselect signal”). The input data port 13 in this case is a set ofconductors that extends from outside the processor and to the registerfile read stage 11. The asserting of the start signal 21 informs theprocessor that the input data value 20 on the input data port 13 isavailable to be read. In response to the assertion of the start signal21, the state machine transitions to the enable clock signal state 22.The transition of the state machine to the enable clock signal state 22enables the pipeline 7 by supplying the clock signal CLK 17 to thepipeline 7. At the same time that the input data value is being suppliedto the processor via conductors 23 and the input data port 13, aninitial fetch information value 24 is supplied to the processor 4 viaconductors 25 and initial fetch information port 14. In the presentexample, the initial fetch information determination circuit 5 includesa characterizer circuit and a Ternary Content Addressable Memory (TCAM).The characterizer is an amount of combinatorial logic that receives theinput data value, characterizes various parts of the input data value,and generates therefrom a set of flag values. The value of a particularflag as output by the characterizer indicates whether the input datavalue has a corresponding particular characteristic. If, for example,the input data value 20 is an IPv4 network packet, then thischaracteristic is detected by the characterizer and the characterizerassert an IPv4 flag (the IPv4 flag is set), otherwise the characterizerdoes not assert the IPv4 flag (the IPv4 flag is cleared). There are manyflags output by the characterizer, with each different flag indicatingwhether the input data value has a corresponding differentcharacteristic. The flags as output by the characterizer are supplied toinputs of the TCAM. Depending on the values of the flags determined fromthe input data value 20, the TCAM outputs a multi-bit value (referred toas the “input fetch information value”) onto the initial fetchinformation port 14 of the processor circuit 2.

The fetch request stage 8 generates memory requests that are supplied tothe external memory system 3. The fetch request stage 8 can only outputa memory request in response to either: 1) an incoming input data valueand/or an incoming initial fetch information value, or 2) a fetchinformation value supplied to the fetch request stage as a result ofexecution by the pipeline of a fetch instruction. In the presentexample, both an incoming input data value is being supplied to thepipeline as well as an associated initial fetch information value. Theincoming input data value 20 and/or initial fetch information value 24prompts the pipeline 7 to issue a memory request 26. The memory request26 is communicated to the external memory system 3. As explained infurther detail below, the memory request 26 is a request to read one128-bit word 57 from the memory, where the address of the 128-bit word57 is given by a base address value 28 and an offset value 29. The128-bit word 47 is located at the beginning of a section 27 of code. A128-bit word is also referred to here as a “block of information”. Thememory of the memory system 3 is organized as a set of uniquelyaddressable 128-bit words. The base address value identifies thebeginning of a table, TABLE#1 in this case, of code. The offset valueidentifies an offset from the base address 28 at the beginning of thetable to the beginning of the section 27 of code. The external memorysystem 3 stores many such tables of code. The tables in FIG. 1 aredenoted TABLE#0, TABLE#1, to TABLE#N.

In one specific example, the particular section 27 of code that theprocessor is prompted to fetch within table TABLE#1 depends on theinitial fetch information value 24. The particular table as well isdetermined by the initial fetch information value 24. The initial fetchinformation value 24 includes a table number value. The fetch requeststage 8 includes a table number to base address lookup circuit 30. Thetable number value is supplied to the lookup table circuit 30, and thelookup table circuit 30 outputs the base address value for the table.The base address value is then incorporated into the actual memoryrequest 26.

The memory system 3 responds by returning to the processor circuit 2 amemory response 31. The memory response 31 includes one 128-bit block ofinformation at the beginning of the identified section 27 of code. The128-bit block of information 57 contains sixteen octets. The 128-bitblock of information 47 includes a plurality of instructions, where aninstruction can involve one, two or three octets, depending on the typeof instruction. The number of instructions in a 128-bit block istherefore variable. The 128-bit block of information 57 is received bythe fetch shift selector stage 9. The fetch shift selector stage 9stores the 128-bit block of information 57, and then outputs threeoctets, where the particular octets output are for the next instructionto be consumed by the pipeline. Immediately after the fetch of the128-bit block 57, it is the first, second and third octets of the128-bit block that are output from the fetch shift selector stage 9.

The decode stage 10 receives the selected octets 32, and decodes theinstruction. Based on the instruction, the decode stage 10 loads an Aregister pointer AP 33, a B register pointer BP 34, carry flag bit C 67,zero flag bit Z 68, a stack pointer SP 35, and a packet pointer PP 36.The A register pointer AP 33 identifies one register (8-bit portion) ofa register file 37 in the register file read stage 11. This identified8-bit portion contains the value of the A register for the instructionto be executed. The B register pointer BP 34 identifies another register(8-bit portion) of the register file 37 that contains the value of a Bregister for the instruction to be executed. The stack pointer SP 35identifies one register (8-bit portion) of the register file 37 that isthe top of the stack. The 8-bit portions of the register file are usableas a stack, and there are instructions in the instruction set of theprocessor that use the stack. The packet pointer PP 36 identifies onebit in the input data register 38 in the register file read stage 11,where the bit is the first bit of a multi-bit value to be used in theinstruction to be executed. In addition to determining the pointervalues, the decode stage 10 sends a “number of octets consumed signal”39 back to the fetch shift selector stage 9. The number of octetsconsumed depends on the instruction just consumed. If the instructionjust consumed involves only one octet, then the decode stage 10 informsthe fetch shift selector stage 9 to shift the bits the fetch shiftselector stage outputs by one octet. If the instruction just consumedinvolves two octets, then the decode stage 10 informs the fetch shiftselector stage 9 to shift the bits the fetch shift selector stageoutputs by two octets. If the instruction just consumed involves threeoctets, then the decode stage 10 informs the fetch shift selector stage9 to shift the bits the fetch shift selector stage outputs by threeoctets. Which octets of the block of information 57 that are output bythe fetch shift selector stage 9 are therefore determined by the decodestage 10 using the number of octets consumed signal 39.

The register file read stage 11 stores the input date value 20 into aninput data register 38, and sends a signal 56 back to the state machine6, thereby causing the state machine 6 to transition from the enableclock signal state 22 to the operating state 50. The state machine 6signals the external circuit that the processor circuit 2 has receivedthe input data value 20 by outputting an operating signal 55. Theexternal circuit can then stop driving input data value 20 onto theinput data port 13.

The register file read stage 11 uses the pointer values 33 and 34 fromthe decode stage to identify the portions of the register file 37 thatstore the A register value RA 40, and store the B register value RB 41.The register file read stage 11 uses the packet pointer value 36 fromthe decode stage to identify the portion of the input data register 38that stores the PCK data value 42 to be used by the instruction. Thecontents of the register file 37 are output from the register file readstage 11 to the output buffers 59, but the output buffers 59 aredisabled. The contents of the register file 37 are therefore not drivenonto the output data port 15.

The execute stage 12 receives the RA value 40 (the contents of the Aregister), the RB value 41 (the contents of the B register) and the PCKdata value 42 from the register file read stage 11. The operation to beperformed on these values is determined by control signals (not shown)received from the decode stage 10, where the operation is determined bythe opcode of the instruction. The instruction set of the processorincludes several different types of instructions including: ALU(Arithmetic Logic Unit) instructions, memory access instructions fordata, instruction fetch instructions, and processor controlinstructions. Some of the instructions use the packet pointer 36 and theinput data register 38 so that the instruction can obtain and use a partor parts of the input data value 20. Although not illustrated in FIG. 1,there is also another pointer and another register, where the otherregister stores the initial fetch information value 24. Otherinstructions use this pointer and this other register to obtain and usea part or parts of the initial fetch information value 24. In addition,flags are included into the input data value 20 as stored in the inputdata register 38, so these flags are also available for reference byinstructions executed by the processor circuit 2. After an instructionhas been consumed by the decode stage of the pipeline, the nextinstruction in the fetched block of information is supplied to thedecode stage. The instructions of the fetched block of instructions areexecuted one by one.

If the execute stage is executing a fetch instruction, then the executestage supplies fetch information 44 back to the fetch request stage 8via conductors 45. The execute stage also supplies associated data 46via conductors 47. In the same way that an externally prompted fetch isprompted by fetch information received on initial fetch information port14 and input data value received on input data port 13, so too is aninternally prompted fetch from the execute stage 12 prompted by fetchinformation 44 on conductors 45 and data 46 on conductors 47.

As stated above, once the pipeline is operating it does not and cannotfetch instructions unless either: 1) it is prompted to by the receipt ofanother input data value (and associated initial fetch informationvalue) or, 2) it is prompted to by execution of a fetch instruction. Ifthe processor executes the last instruction of the fetched block ofinformation and there is not a next instruction that has already beenfetched, then the processor would hang. Accordingly, in the presentexample, the last instruction of the fetched block of information 57 isanother fetch instruction. This last fetch instruction causes theprocessor to fetch the next 128-bit block of information from the samesection 27 of code. The processor then continues on executinginstructions from this second 128-bit block of information. The section27 of code has a particular function. At the end of the code forperforming this function is another fetch instruction, but this fetchinstruction is an instruction to fetch the next 128-bit block of codefrom another table. In this way, the code executed by the processor ismodular, with the code of one table causing a fetch into the code ofanother table, and so forth, from table to table. When fetching into thenext table, the offset into the table is typically determined by acharacteristic of the input data value 20, as recorded by flagsgenerated by the characterizer. In some embodiments, the flags asdetermined by the characterizer are incorporated into the input datavalue 20 as stored in the input data register 38. When execution jumpsfrom one table to the next, the particular section of code that isspecifically tailored to data having a characteristic is vectored to (asopposed to vectoring to another section of the table whose code is notfor data having the characteristic) due to the fetch instruction havingaccess to the flags.

After the functions of the code have been carried out and execution ofthe code has traversed from table to table, a final “finishedinstruction” is executed. Execution of the finished instruction causesthe execute stage 12 to assert a finished signal 48 on conductor 49.Asserting of the finished signal 48 causes the state machine 6 totransition from the operating state 50 to the finished state 51. In thefinished state 51, the state machine asserts a finished signal 52 thatis output from the processor circuit 2. The finished signal 52 as outputfrom the processor circuit 2 is also referred to as the “PE has data tobe read” signal. Assertion of the finished signal 52 indicates to anexternal circuit that the processor circuit 2 has data to supply to theexternal circuit. In response to the assertion of the “PE has data to beread” signal 52, the external circuit enables the outputting of the dataoutput value 53 onto output data port 15 by asserting a “PE selectsignal” 58. Assertion of the PE select signal 58 causes the outputbuffers 59 to be enabled. The buffers 59 then drive the contents of theregister file 37 onto the output data port 15 and to the externalcircuit. Execution of the finished instruction also causes the statemachine to stop the clock signal CLK from being supplied to thepipeline. The pipeline therefore stops clocking, and power consumptionis reduced.

While the PE select signal 58 is asserted and the output data value 53is being driven onto the output data port 15, the external circuit readsthe output data value 53 from the output data port 15. The externalcircuit then deasserts the PE select signal 58 thereby disabling driver59, and asserts an “output data was read” signal 54. Assertion of the“output data was read signal” 54 causes the state machine 6 totransition to the idle state 16. In the idle state 16, the state machineasserts the idle signal 18. At this point, the pipeline is not beingclocked, but it is ready to receive another input data value and anotherassociated initial fetch information value.

FIG. 2 is a diagram of the program code stored in the external memory 3.The memory is organized as many uniquely addressable 128-bit blocks ofinformation. There are many such 128-bit blocks of information in onesection of code, and there are many sections of code in one table, andthere are N tables stored in the memory. In the illustrated example, theinitial fetch (the one initially prompted from outside the processor byincoming data) is identified by the circled numeral “1”. The incominginitial fetch information causes the pipeline to start clocking. Theresulting first fetch from the external memory has a base address 28that identifies the first word 57 of TABLE#1. The table number given bythe initial fetch information value 24 is translated by the lookup tablecircuit 30 into the base address value 28 that is then used in thememory request 26. The offset 29 from the beginning location of TABLE#1identifies the beginning 128-bit block 57 of section 27 of code. Thisoffset 29 is specified by the initial fetch information. Once thissection 27 of code has been executed, a fetch instruction causes codeexecution to jump to the fourth section of TABLE#0. This is identifiedin FIG. 2 by the circled numeral “2”. After execution of this section ofcode, a fetch instruction causes code execution to jump to the firstsection of the code of TABLE#4. This is identified in FIG. 2 by thecircled numeral “3”. The instruction fetches that causes the fourth andfifth jumps are identified in FIG. 2 by the circled numerals “4” and“5”. At the end of the fourth section of code of TABLE#8 is a “finished”instruction. This finished instruction causes the pipeline to stopclocking, and causes the external circuit to be signaled that theprocessor circuit 2 has an output data value 53 to be read on outputdata port 15.

Each section of code is typically an amount of code that is specializedto do a particular discrete task on input data having a particularcharacteristic or characteristics. In one simplified illustrativeexample, a first section of code does VLAN and MAC address processing, asecond section of code does IP header analysis processor, a thirdsection of code does tunnel decapsulation processing, and a fourthsection of code does inner header processing. Execution of a fetchinstruction at the end of the first section references an IP headerversion flag (a flag in the initial fetch information value 24 thatindicates whether packet data is IPv4 or IPv6), and as a result of thisflag fetches code at the beginning of the second section. Execution of afetch instruction at the end of the second section references a headervalue in the input data value 20 (the header value indicates whether thepacket is a tunnel packet, and if so what kind of tunnel), and as aresult of this header value fetches code at the beginning of the thirdsection. Execution of a fetch instruction at the end of the thirdsection references a set of data values stored in memory system 3 (theset of data values indicates whether the packet data is an ethernetframe or an IP packet), and as a result of this set of data valuesfetches code at the beginning of the fourth section. Another processor(not shown) preloads the set of data values into the memory system 3 sothat the set of data values is later usable by processor circuit 2executing a fetch instruction to determine which section of code toexecute next. Memory system 3, in addition to storing blocks ofinformation of code, stores many such sets of data values.

In one example, the processor circuit 2 is one of many such processorcircuits (also referred to picoengines) in a pool (also referred to as apicoengine pool). The output data values from the processor circuits areread out of the pool one by one, and are stored in an external FIFO. Anexternal output data reader circuit supplies a PE select signal to eachof the processor circuits 2, but it only asserts one PE select signalgoing to one processor circuit at a time. The currently selectedprocessor circuit is made to output its output data value onto a commonoutput bus, and the output data value is communicated via this bus tothe FIFO. After the output data value is stored in the FIFO, the outputdata reader circuit deasserts the PE select signal and asserts anotherPE select signal, so that another of the processor circuits will thenoutput its output data value onto the common output bus. In this way theoutput data values from processor circuits are read, one by one. Eachoutput value includes a buffer pool number value that indicates aparticular processor (an ME microengine processor) that will performfurther processing on the input data value. A first particular type ofinput data values will typically be further processed by a first MEprocessor, whereas a second particular type of input data values willtypically be further processed by a second ME processor, and so forth.For additional information on a picoengine pool and an output datareader, see: U.S. patent application Ser. No. 14/251,592, entitled“Picoengine Multi-Processor With Task Management”, filed Apr. 12, 2014,by Gavin J. Stark (the entire subject matter of which is incorporatedherein by reference).

FIG. 3 is a diagram of one section 60 of code. Each 128-bit block ofinformation (one row in the diagram) includes 16 octets. In thisexample, there are thirty-two 128-bit blocks of information in thesection 60.

FIG. 4 is a diagram of one 128-bit block 61 of information, and onethree-octet instruction 62 within the block 61. The first octet of eachinstruction starts with a “0” bit. The second octet of a multi-octetinstruction starts with a “1” bit. The third octet of a three-octetinstruction starts with a “1” bit. The decode stage 10 uses theseleading bits of the octets to parse the octets of a block of informationand to identify the boundaries between instructions.

FIG. 5 is a diagram that illustrates a fetch instruction where theoffset value is a value in the initial fetch information value. Theinstruction is a three-octet instruction. The opcode 63 is ten bits. Thefour “mmmm” bits 64 and the two “MM” bits 65 together form a six-bitvalue, where this six-bit value identifies one eight-bit portion of theinitial fetch information value that contains the offset value. Eacheight-bit portion of the initial fetch information value is numbered,and the value “MMmmmm” is the number of one of these eight-bit portions.The five “ttttt” bits 66 indicate the table number. As mentioned above,in one example the table number is translated by the lookup tablecircuit 30 into the base address value where the table starts in memory.

FIG. 6 is a diagram that illustrates a fetch instruction where theoffset value is a value in the input data value. The instruction is atwo-octet instruction. The opcode 70 is seven bits. The two “MM” bits 71indicate the memory that contains the table. In the present example,memory system 3 is identified by an “MM” value of “00”. The five“tttttt” bits 72 indicate the table number. The packet pointeridentifies one of the eight-bit portions of the input data value, andthis eight-bit portion is used as the offset value.

FIG. 7 is a diagram that illustrates a fetch instruction where theoffset value is in a specified register in the register file 37. Theinstruction is a three-octet instruction. The opcode 73 is ten bitslong. The four “nnnn” bits 74 indicate the number of the register in theregister file 37 that contains the offset value into the table. The two“MM” bits 75 indicate the memory that contains the table to be fetchedfrom. The five “ttttt” bits 76 specify the table number.

FIG. 8 is a diagram that illustrates a fetch more instruction. Thisinstruction is one octet in length, and only contains a seven-bit opcode77. The instruction causes a fetch of the next 128-bit block ofinformation that is located in the memory immediately after the last128-bit block of information that was fetched. The memory from which thefetch is conducted is the same memory from which the last fetch wasconducted.

FIG. 9 is a diagram of pop stack absolute instruction. As mentionedabove, the registers of the register file 37 are used as a stack. Theopcode is a combination of the six bits 91 and the three bits of 93. TheALU operation is determined by the four-bit code 96, 97. In the presentexample, the ALU operation is an add operation. The absolute pointervalue 92 points to a specific register of the register file 37. Theabsolute pointer value 92 is “absolute” in that it points to aparticular register, regardless of the value of the stack pointer. Theterm “absolute” is used to distinguish a relative pointer value thatmight identify a register in relation to another register, such as theregister at the top of the stack. Each register of the register file isassigned a number, and the absolute pointer value is the number of theparticular register. In the pop stack absolute instruction, the valuestored in the specific register (pointed to by the absolute pointervalue 92) is added to the value popped off the top of the stack, and theresult is written back into the specific register. The values of thecarry and zero flags 67 and 68 are used as appropriate for the ALUoperation called out by the four-bit code 96, 97, but due to the “flagdon't touch” bit being a “1” the value of the flags (carry flag and zeroflag) are not changed due to the execution of the instruction. Theinstruction is a conditional instruction in that the operation is onlyperformed if the predicate condition is true, as specified by the threepredicate bits 94.

FIG. 10 is a diagram that sets forth the predicate codes indicated bythe three predicate bits.

FIG. 11 is a diagram that illustrates the finished instruction. Thisinstruction is one octet in length and includes a seven-bit opcode 78.As mentioned above, execution of the finished instruction causes thepipeline to stop clocking, and causes the state machine to transition tothe finished state. In the finished state, the state machine causes theprocessor circuit 2 to assert the “PE has data to read” signal 52.

FIG. 12 is a state diagram of the state machine 6. The four states arethe idle state 16, the enable clock signal state 22, the operating state50, and the finished state 51. Assertion of the start signal 21 (alsocalled the “PE select signal”) causes the state machine to transitionfrom the idle state to the enable clock signal state. Assertion of theoperating signal 55 (also called the “PE has read the data” signal)causes the state machine to transition from the enable clock signalstate to the operating state. Assertion of the finished signal 48 fromthe execute stage causes the state machine to transition from theoperating state to the finished state. Assertion of the “output data wasread” signal 54 causes the state machine to transition from the finishedstate to the idle state.

FIG. 13 is a simplified diagram of the lookup table circuit 30 in thefetch request stage 8 of FIG. 1. The data contents of the memory portion80 can be written via a control bus CB 81. An address 82 of a memorylocation in the memory portion 80 is supplied via lines 83, and theread/write signal 84 is set to indicate a write operation, and the data85 to be written is supplied via the control bus 81 to the memoryportion 80. In this way, the contents of the addressed memory locationof the memory portion 80 are pre-loaded and setup before processorcircuit 2 operation, or during downtimes during which the processorcircuit 2 is not being used. To perform a table number value to baseaddress value lookup, the table number 86 is supplied to the lookuptable circuit 30 via input conductors 87 when the read/write controlsignal 84 is set to indicate a read operation. The read/write signal 84controls the address multiplexer 88. The multi-bit content of the memorylocation addressed by the table number value is then output from thelookup table circuit 30 onto output conductors 89 as the base addressvalue 90.

FIG. 14 is a flowchart of a method 100 in accordance with one novelaspect. An input data value is received (step 101) onto a pipelinedrun-to-completion processor. In one example, the input data value is theinput data value 20 of FIG. 1. The processor includes no instructioncounter. An initial fetch information value is also received (step 102)onto the processor. In one example, the input fetch information value isthe initial fetch information value 24 of FIG. 1. In response to thereceiving of the input data value and/or the initial fetch informationvalue, the processor starts clocking (step 103). In the example of FIG.1, the clock signal CLK is supplied to the pipeline. In response to thereceiving of the input data value and/or the initial fetch informationvalue, the processor fetches (step 104) a first block of informationfrom an external memory system. The base address value and the offsetvalue that together address the beginning of the block of informationare determined using the initial fetch information value and/or theinput data value. In one example, the initial fetch information valueincludes a table number value that is then converted into the baseaddress value. In one example, the initial fetch information valueincludes a number that is then converted into the offset value.Depending on the particular embodiment, the number that is part of theinitial fetch information value either is the offset value, or is anumber that is then converted into the offset value. As a result of thefirst fetch, the first block of information is received onto theprocessor. The first block of information includes a plurality ofinstructions. One of the instructions is a fetch instruction. This fetchinstruction is executed (step 105) by the processor and as a result asecond block of information is retrieved from the external memorysystem. The second block of information, like the first block, includesa plurality of instructions. Instructions of the second block ofinformation are then executed by the processor. The second block ofinformation may be the next block of information in a section of code inthe same table, or may be a nonadjoining block of information in thesame table, or may be a block of information in another table. Executionof the program of instructions moves from section to section, and tableto table, with the code of each section being specialized to handle aparticular aspect of processing of the input data value. At the end ofthe program of instructions is a finished instruction. Execution of thefinished instruction (step 106) causes a finished signal to be outputfrom the processor and causes the clocking of the processor to stop. Anexternal circuit can then read the output data value.

Although in the specific embodiment of FIG. 1, the lookup table circuit30 is disposed in the fetch request stage 8, in other embodiments thelookup table circuit that converts a table number value into a baseaddress value is disposed in the memory system 3. In still otherembodiments, there is no table number to base address lookup tablecircuit. If a lookup table circuit is disposed in the memory system 3,then the memory request 26 as received onto the memory system 3 mayinclude the table number value. The lookup table circuit of the memorysystem 3 then uses the table number value to determine the base addressvalue, and the base address value along with the offset value is thenused to read the block of information from the memory of the memorysystem. In the same way that a table number value can be converted intoa base address value by a lookup table circuit located in the fetchrequest stage 8, so too can another value (for example, a flag value orflag values) in the initial fetch information value 24 be converted by alookup table circuit in the fetch request stage 8 into the offset value.Similarly, a lookup table circuit that converts a flag value or valuesinto the offset value can be located in the memory system 3. Thecontents of these lookup table circuits can be loaded by the processorcircuit itself, or in other embodiments can be loaded via a separatecontrol bus (CB).

In one example, to realize an integrated circuit embodiment of thepipelined run-to-completion processor 4 of FIG. 1, the function of theeach circuit block of the processor 4 is described in a hardwaredescription language (for example, Verilog or VHDL). A commerciallyavailable hardware synthesis program (for example, Synopsis DesignCompiler) is then employed to generate digital logic circuitry from thehardware description language description, where the synthesized digitallogic circuitry performs the function described by the hardwaredescription language. The processor 4 is realized in this way to be asmall circuit of about ten thousand equivalent gates. An embodiment ofprocessor 4 may be made available by one company as a predesigned blockof circuitry that is then incorporated into another company's integratedcircuit design as a general purpose block. Such a predesigned block ofIP is sometimes referred to in the art as a block of “IP”. A hardwaredesigner who incorporates the predesigned block of IP into a largerintegrated circuit design need not understand or be aware of theinternal structure and operation of the pre-designed block, but ratherinterfaces to the pre-designed block in accordance with an interfacedescription supplied by the original designer of the predesigned block.Rather than being supplied as a block of IP to be incorporated intoanother integrated circuit, the novel processor 4 can be supplied to endcustomers as a separate discrete integrated circuit of general utilityin data processing applications.

Although certain specific embodiments are described above forinstructional purposes, the teachings of this patent document havegeneral applicability and are not limited to the specific embodimentsdescribed above. The particular interface signaling and interface logicof FIG. 1 that interfaces the pipelined run-to-completion processor 4 tothe external circuit that kick-starts the processor and that readsoutput data values, as described above in connection with FIG. 1, isjust one illustrative example. Other suitable interface circuits areemployed in other embodiments. Input data values going into theprocessor and output data values coming out of the processor may bebuffered, for example using FIFOs. Accordingly, various modifications,adaptations, and combinations of various features of the describedembodiments can be practiced without departing from the scope of theinvention as set forth in the claims.

What is claimed is:
 1. A method comprising: (a) receiving an input valueonto a processor; (b) converting the input value into a base addressvalue and an offset value, wherein the base address is the base addressof a table of code in an external memory, and wherein the offset valueindicates an offset from the base address to a section of code withinthe table; (c) in response to the receiving of the input value of (a)fetching a first block of information of the section of code without useby the processor of any instruction counter, wherein the first block ofinformation includes a plurality of instructions, wherein at least oneof the instructions of the first block is a fetch instruction, andwherein the processor only fetches instructions in response to receivingan input value from an external source or as a result of executing afetch instruction; and (d) executing the instructions of the first blockof information including executing the fetch instruction.
 2. The methodof claim 1, wherein the processor has a pipeline, wherein the pipelineprior to the receiving of (a) is not being clocked, and wherein thereceiving of the input value in (a) causes a clocking of the pipeline tostart.
 3. The method of claim 1, wherein the processor has a pipeline,and method further comprising: (e) executing a finished instruction,wherein execution of the finished instruction causes a clocking of thepipeline to stop.
 4. The method of claim 1, wherein the input value isan input data value received onto an input data value port of theprocessor.
 5. The method of claim 1, wherein the input value is a fetchinformation value received onto an initial fetch information port of theprocessor.
 6. The method of claim 1, wherein the processor has apipeline, wherein the pipeline comprises a fetch request stage, andwherein a lookup table circuit in the fetch request stage determines thebase address value from a part of the input value.
 7. The method ofclaim 1, wherein the external memory has a lookup table circuit, whereina memory request received onto the external memory includes a tablenumber value, and wherein the lookup table circuit generates the baseaddress value from the table number value.
 8. The method of claim 1,wherein the processor has a pipeline, wherein the pipeline comprises afetch request stage, wherein the input value includes a table number,and wherein a lookup table circuit in the fetch request stage determinesthe base address value from the table number.
 9. The method of claim 1,wherein the input value is a part of a network packet.
 10. The method ofclaim 1, wherein the input value is a set of flags that characterize anetwork packet.
 11. The method of claim 1, wherein the processorincludes a pipeline, wherein the converter of (b) is performed by afetch stage of the pipeline.
 12. A processor comprising: means forfetching blocks of information from a memory system external to theprocessor without the use of an instruction counter, wherein the meansonly fetches blocks of information from the memory system in response toeither a receiving of a fetch information value onto the processor froman external source or to a receiving of a fetch information value from astage within the processor, wherein the processor includes noinstruction counter and the means fetches block of information withoutuse of any instruction counter, wherein a fetch information valuereceived onto the processor from the external source includes a tablenumber value, and wherein the means determines a base address value fromthe table number value, and wherein the means includes the base addressvalue in a memory request that is supplied from the means to the memorysystem, wherein the base address is a base address of a table thatcontains the block of information; a decode stage coupled to the means,wherein the decode stage can decode a fetch instruction; a register fileread stage coupled to the decode stage; and an execute stage coupled tothe register file read stage, wherein the execute stage executes thefetch instruction by outputting fetch information to the fetch requeststage thereby prompting the means to fetch a block of information. 13.The processor of claim 12, wherein the means for fetching comprises afetch request stage and a fetch shift selector stage, wherein the fetchrequest stage includes a lookup table circuit and outputs memoryrequests to the memory system, and wherein the fetch request selectorstage receives memory responses from the memory system.
 14. Theprocessor of claim 12, wherein the memory request includes an offsetvalue, and wherein the means is also for determining the offset valueand then including the offset value in the memory request.
 15. Theprocessor of claim 14, wherein the offset value is a part of the fetchinformation value.
 16. The processor of claim 14, wherein an input datavalue is received onto the processor along with the fetch informationvalue, and wherein the offset value is a part of the input data value.17. The processor of claim 12, wherein the fetch information value is afetch instruction.
 18. A system comprising: a processor comprising:means for fetching blocks of information without the use of aninstruction counter, wherein the means only fetches blocks ofinformation in response to either a receiving of a fetch informationvalue onto the processor from an external source or to a receiving of afetch information value from a stage within the processor, wherein theprocessor includes no instruction counter and the means fetches blocksof information without use of any instruction counter, wherein a fetchinformation value received onto the processor from the external sourceincludes a table number value; a decode stage coupled to the means,wherein the decode stage can decode a fetch instruction; a register fileread stage coupled to the decode stage; and an execute stage coupled tothe register file read stage, wherein the execute stage executes thefetch instruction by outputting fetch information to the fetch requeststage thereby prompting the means to fetch a block of information; and amemory system external to the processor, wherein the memory systemreceives a memory request from the processor, wherein the memory requestincludes the table number value, wherein the memory system determines abase address value from the table number value, and wherein the baseaddress value is a base address of a table of code stored in the memorysystem that contains the block of information.
 19. The system of claim18, wherein a fetch information value received onto the processor fromthe external source includes a flag value, and wherein the memory systemuses the flag value from the fetch information value to determine anoffset value, and wherein the block of information is stored in thememory system at an address given by the sum of the base address valueand the offset value.
 20. The processor of claim 18, wherein the meansfor fetching comprises a fetch request stage and a fetch shift selectorstage, wherein the fetch request stage outputs memory requests to thememory system, and wherein the fetch request selector stage receivesmemory responses from the memory system.